package 力扣.周赛.蔚来;

public class 最长公共子路径 {

    public int longestCommonSubpath(int n, int[][] paths) {
        if (paths.length==0)
              return 0;
        int[] path = paths[0];
        for (int i = 1; i < paths.length; i++) {
            for (int j = 0; j < path.length && j < paths[i].length; j++) {

            }
        }
        return 0;
    }
}
